Complexity of the minimum-length corridor problem
نویسندگان
چکیده
We study the Minimum-Length Corridor (MLC) problem. Given a rectangular boundary partitioned into rectilinear polygons, the objective is to find a corridor of least total length. A corridor is a set of line segments each of which must lie along the line segments that form the rectangular boundary and/or the boundary of the rectilinear polygons. The corridor is a tree, and must include at least one point from the rectangular boundary and at least one point from the boundary of each of the rectilinear polygons. We establish the NP-completeness of the decision version of the MLC problem even when it is restricted to a rectangular boundary partitioned into rectangles. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Complexity of minimum corridor guarding problems
In this paper, the complexity of minimum corridor guarding problems is discussed. These problem can be described as: given a connected orthogonal arrangement of vertical and horizontal line segments and a guard with unlimited visibility along a line segment, find a tree or a closed tour with minimum total length along edges of the arrangement, such that if the guard runs on the tree or on the c...
متن کاملApproximation Algorithms for the Minimum-Length Corridor and Related Problems
Given a rectangular boundary partitioned into rectangles, the MLC-R problem is to find a Minimum EdgeLength Corridor that visits at least one point from the boundary of every rectangle and from the rectangular boundary. We present the first polynomial time constant ratio approximation algorithm for the MLC-R problem, which has been shown to be NP-hard [5].
متن کاملOn the Minimum Corridor Connection Problem and Other Generalized Geometric Problems
In this paper we discuss the complexity and approximability of the minimum corridor connection problem where, given a rectilinear decomposition of a rectilinear polygon into “rooms”, one has to find the minimum length tree along the edges of the decomposition such that every room is incident to a vertex of the tree. We show that the problem is strongly NP-hard and give a subexponential time exa...
متن کاملOn the minimum corridor connection problem and other generalized geometric problems ⋆ ( Online
In this paper we discuss the complexity and approximability of the minimum corridor connection problem where, given a rectilinear decomposition of a rectilinear polygon into “rooms”, one has to find the minimum length tree along the edges of the decomposition such that every room is incident to a vertex of the tree. We show that the problem is strongly NP-hard and give an subexponential time ex...
متن کاملThe Steiner Multigraph Problem: Wildlife Corridor Design for Multiple Species
The conservation of wildlife corridors between existing habitat preserves is important for combating the effects of habitat loss and fragmentation facing species of concern. We introduce the Steiner Multigraph Problem to model the problem of minimum-cost wildlife corridor design for multiple species with different landscape requirements. This problem can also model other analogous settings in w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 37 شماره
صفحات -
تاریخ انتشار 2007